A Graph Representation of Filter Networks
نویسندگان
چکیده
Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finite impulse response filters. The efficiency is due to the significantly reduced number of multiplications and additions per data sample that is required. The computational gain is dependent on the choice of network structure and the graph representation compactly incorporates the network structure in the design objectives. Consequently the graph representation forms a framework for searching the optimal network structure. It also removes the requirement of a layered structure, at the cost of a less compact representation.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملFactor Graphs and Dynamical Electrical Networks
Abstract — Factor graphs are graphical models with origins in coding theory. The sum-product and the maxproduct algorithms, which operate by message passing on a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. This paper aims at extending the field of possible applications to dynamical electrical networks. Interestingly, the resulti...
متن کامل